Casual conversation as logical constraint satisfaction

نویسنده

  • jean-louis Dessalles
چکیده

Casual conversation seems to be the last domain in which logic may be successfully applied. We want to demonstrate here that this intuition is incorrect. On the contrary, logic offers a new perspective on conversation, not at the behavioural level, but at the argumentative level. By studying the way arguments are logically linked together, we can observe new phenomena, like conflicting beliefs or conflicting desires that are shared by participants, and strategies to escape from such situations. From this new perspective, conversation emerges as a logical constraint satisfaction process.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Video Contents Acquisition and Editing for Conversation Scene

This paper introduces a novel method for capturing conversation scenes and editing of the obtained videos. This system aims to acquire high-quality videos and to utilize them for multimedia that provides conversation functions. First, a video capturing system composed of “environmental camera module” and “contents capturing camera modules” is introduced. Next, a novel computational video editin...

متن کامل

Casual Conversation Technology Achieving Natural Dialog with Computers

In recent years, voice recognition agents such as NTT DOCOMO’s “Shabette Concier” have become popular. ShabetteConcier is a voice agent capable of responding to task-related utterances such as “send mail” or “call,” and can answer questions such as “how high is Mount Fuji?” or “what is the highest mountain in the world?” It can also respond to casual conversation with utterances such as “I love...

متن کامل

A finer reduction of constraint problems to digraphs

It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph. We present a variant of this construction and show that the corresponding constraint satisfaction problem is logspace equivalent to that over A. Moreover, we show that almost all of the commonly encountered polymorp...

متن کامل

The logic of satisfaction constraint

Mackworth, A.K., The logic of constraint satisfaction, Artificial Intelligence 58 (1992) 3-20. The constraint satisfaction problem (CSP) formalization has been a productive tool within Artificial Intelligence and related areas. The finite CSP (FCSP) framework is presented here as a restricted logical calculus within a space of logical representation and reasoning systems. FCSP is formulated in ...

متن کامل

Logical Representations in Drafting and CAD Systems

In this paper we present a logical language for representing and reasoning about drawings in the context of interactive computer graphics. We discuss the motivation for this kind of representation in graphics systems and its applications to geometric reasoning and constraint satisfaction. A formal deenition of the language and its interpretation process is presented and illustrated. The theoret...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998